The Ramsey number of paths with respect to wheels
نویسندگان
چکیده
For graphs G and H , the Ramsey number R(G,H) is the smallest positive integer n such that every graph F of order n contains G or the complement of F contains H . For the path Pn and the wheel Wm, it is proved that R(Pn,Wm) = 2n − 1 if m is even, m 4, and n (m/2)(m − 2), and R(Pn,Wm)= 3n− 2 if m is odd, m 5, and n (m− 1/2)(m− 3). © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملOn the Ramsey numbers for linear forest versus some graphs
For given graphs G and H; the Ramsey number R(G;H) is the leastnatural number n such that for every graph F of order n the followingcondition holds: either F contains G or the complement of F contains H.In this paper firstly, we determine Ramsey number for union of pathswith respect to sunflower graphs, For m ≥ 3, the sunflower graph SFmis a graph on 2m + 1 vertices obtained...
متن کاملThe Ramsey Numbers of Paths Versus Wheels: a Complete Solution
Let G1 and G2 be two given graphs. The Ramsey number R(G1, G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or G contains a G2. We denote by Pn the path on n vertices and Wm the wheel on m + 1 vertices. Chen et al. and Zhang determined the values of R(Pn,Wm) when m 6 n + 1 and when n + 2 6 m 6 2n, respectively. In this paper we determine all the value...
متن کاملA Note on Planar Ramsey Numbers for a Triangle Versus Wheels
We assume that the reader is familiar with standard graph-theoretic terminology and refer the readers to Bondy and Murty (2008) for any concept and notation that is not defined here. In this paper, we consider simple, undirected graphs. Given two graphsG andH , the Ramsey numberR(G,H) is the smallest integer n such that every graph F on n vertices contains a copy of G, or its complement F conta...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 294 شماره
صفحات -
تاریخ انتشار 2005